On Sorting by Translocations
نویسندگان
چکیده
The study of genome rearrangements is an important tool in comparative genomics. This paper revisits the problem of sorting a multichromosomal genome by translocations, i.e., exchanges of chromosome ends. We give an elementary proof of the formula for computing the translocation distance in linear time, and we give a new algorithm for sorting by translocations, correcting an error in a previous algorithm by Hannenhalli.
منابع مشابه
Sorting by Translocations Via Reversals Theory
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome rearrangements that “sorts” one genome into another. In this paper we focus on sorting a multi-chromosomal genome by translocations. We reveal new relationships between this problem and the well studied problem of sorti...
متن کاملlog(n)) algorithm for sorting by reciprocal translocations
We prove that sorting by reciprocal translocations can be done in O(n3/2 √ log(n)) for an n-gene genome. Our algorithm is an adaptation of the algorithm of Tannier, Bergeron and Sagot for sorting by reversals. This improves over the O(n3) algorithm for sorting by reciprocal translocations given by Bergeron, Mixtacki and Stoye.
متن کاملAn O(n3/2sqrt(log n)) Algorithm for Sorting by Reciprocal Translocations
We prove that sorting by reciprocal translocations can be done in O(n p log(n)) for an n-gene genome. Our algorithm is an adaptation of the Tannier et. al algorithm for sorting by reversals. This improves over the O(n) algorithm for sorting by reciprocal translocations given by Bergeron et al.
متن کاملSorting by Reciprocal Translocations via Reversals Theory
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome rearrangements that transforms, or sorts, one genome into another. In this paper we focus on sorting a multi-chromosomal genome by translocations. We reveal new relationships between this problem and the well studied pr...
متن کاملGENESIS: genome evolution scenarios
SUMMARY We implemented a software tool called GENESIS for three different genome rearrangement problems: Sorting a unichromosomal genome by weighted reversals and transpositions (SwRT), sorting a multichromosomal genome by reversals, translocations, fusions and fissions (SRTl), and sorting a multichromosomal genome by weighted reversals, translocations, fusions, fissions and transpositions (SwR...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of computational biology : a journal of computational molecular cell biology
دوره 13 2 شماره
صفحات -
تاریخ انتشار 2005